An efficient algorithm for sequence comparison with block reversals
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming
The main advantage of Constraint Programming (CP) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular expressions, length restrictions, etc). The current best CP approach for SPM uses a global constraint (module) that computes the projected database and enforces the minimum frequency; it does this with a filtering algori...
متن کاملA Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison
In this paper we present a parallel wavefront algorithm for computing an alignment between two strings A and C, with |A| = m and |C| = n. On a distributed memory parallel computer of p processors each with O((m+ n)/p) memory, the proposed algorithm requires O(p) communication rounds and O(mn/p) local computing time. The novelty of this algorithm is based on a compromise between the workload of ...
متن کاملA Parameterized Parallel Algorithm for Efficient Biological Sequence Comparison
In this paper we extend and improve a previous result for computing an alignment (or string editing) between two strings and , with and , which requires communication rounds and local computing time, on a distributed memory parallel computer of processors each with memory. The algorithm is based on a compromise between the workload of each processor and the number of communication rounds requir...
متن کاملAn Efficient Parallel Block-Reduction Algorithm
In this paper, we present a new parallel block-reduction algorithm for reducing lattice bases which allows the use of an arbitrarily chosen block-size between two and n where n denotes the dimension of the lattice. Thus, we are building a hierarchy of parallel lattice basis reduction algorithms between the known parallel all-swap algorithm which is a parallelization for block-size two and the r...
متن کاملA more efficient algorithm for perfect sorting by reversals
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum prime degree d of the strong interval tree, i.e. f(d).n. This improves the best known algorithm which complexity was based on a parameter always larger than or equal to d.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.05.005